Enabling Throttling on Average Write Throughput for Solid State Storage Devices

ABSTRACT

A mechanism is provided for enabling throttling on average write throughput instead of peak write throughput for solid-state storage devices. The mechanism assures an average write throughput within a range but allows excursions of high throughput with periods of low throughput offsetting against those of heavy usage. The mechanism periodically determines average throughput and determines whether average throughput exceeds a high throughput threshold for a certain amount of time without being offset by periods of low throughput.

BACKGROUND

The present application relates generally to an improved data processingapparatus and method and more specifically to mechanisms for enablingthrottling on average write throughput instead of peak write throughputfor solid-state storage devices.

A solid-state drive (SSD) is a data storage device that uses solid-statememory to store persistent data with the intention of providing accessin the same manner of a traditional block I/O hard disk drive. SSDs aredistinguished from traditional hard disk drives (HDDs), which areelectromechanical devices containing spinning disks and movableread/write heads. SSDs, in contrast, use microchips which retain data innon-volatile memory chips and contain no moving parts. Compared toelectromechanical HDDs, SSDs are typically less susceptible to physicalshock, are quieter, and have lower access time and latency. SSDs use thesame interface as hard disk drives, thus easily replacing them in mostapplications.

Lower priced SSDs usually use multi-level cell (MLC) flash memory, whichis slower and less reliable than single-level (SLC) flash memory. Thiscan be mitigated or even reversed by the internal design structure ofthe SSD, such as interleaving, changes to writing algorithms, and higherover-provisioning (more excess capacity) with which the wear-levelingalgorithms can work. The ability to use MLC and preferably consumergrade MLC is very important to getting the cost of SSDs down to increasetheir adoption rate in enterprise applications,

However, MLC devices, or any solid-state memory devices, have severerestrictions on write endurance. More specifically, high rates of writethroughput, if sustained for long enough, can cause the SSD to startexperiencing bad blocks beyond what it can endure. SSDs are mosteffective in helping system performance for random operations;therefore, they certainly must be able to accept high write throughputsat times.

In order to ensure enough life, some SSDs apply wear-leveling bythrottling performance by not allowing the device to go above a certainabsolute maximum. This has the disadvantage of not allowing shortexcursions to get the data into the SSD so that the operations persecond can then be increased. Such throttling can also dramaticallyincrease latency or response time which can trigger cascading eventslike storage write caches filling up and host buffers filling upresulting in very large latencies as seen by the host.

SUMMARY

In one illustrative embodiment, a method, in a data processing system,is provided for throttling a solid-state storage device on average writethroughput. The method comprises for each given period of time,determining average write throughput to a solid-state storage deviceover the given period of time. The method further comprises determininga first amount of time that average write throughput is high anddetermining a second amount of time that average write throughput islow. The method further comprises throttling write throughput to thesolid-state storage device based on a comparison of the first amount oftime and the second amount of time.

In other illustrative embodiments, a computer program product comprisinga computer useable or readable medium having a computer readable programis provided. The computer readable program, when executed on a computingdevice, causes the computing device to perform various ones of, andcombinations of, the operations outlined above with regard to the methodillustrative embodiment.

In yet another illustrative embodiment, a solid-state storage device isprovided. The solid-state storage device may comprise a controller and asolid-state memory coupled to the controller. The controller may beconfigured to perform various ones of, and combinations of, theoperations outlined above with regard to the method illustrativeembodiment.

These and other features and advantages of the present invention will bedescribed in, or will become apparent to those of ordinary skill in theart in view of, the following detailed description of the exampleembodiments of the present invention.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The invention, as well as a preferred mode of use and further objectivesand advantages thereof, will best be understood by reference to thefollowing detailed description of illustrative embodiments when read inconjunction with the accompanying drawings, wherein:

FIG. 1 depicts a pictorial representation of an example distributed dataprocessing system in which aspects of the illustrative embodiments maybe implemented;

FIG. 2 is a Hock diagram of an example data processing system in whichaspects of the illustrative embodiments may be implemented;

FIG. 3 is a Hock diagram illustrating a solid-state drive in whichaspects of the illustrative embodiments may be implemented; and

FIG. 4 is a flowchart illustrating operation of a mechanism for enablingthrottling on average write throughput instead of peak write throughputfor solid-state storage devices in accordance with an illustrativeembodiment.

DETAILED DESCRIPTION

The illustrative embodiments provide a mechanism for enabling throttlingon average write throughput instead of peak write throughput for solidstate storage devices. The method attempts to allow spikes in writethroughput so normal workload variations will not be capped at levelsless than what could otherwise be sustained. The mechanism assures anaverage write throughput within a range but allows excursions of highthroughput with periods of low throughput offsetting against those ofheavy usage.

Throughput for purposes of this disclosure is the rate at which data iswritten to the actual flash devices within the SSDs. In other words,every attempt should be made by the solid state storage to take intoaccount actual data written to the flash since that is what results inwrite endurance issues. For example, if the host writes 4K bytes thatare unaligned to the SSDs flash pages and the result is a read of bothpages and an update to both and then 8K being written to flash, thethroughput calculation should take into account 8K not 4K as done by thehost. Writes of parity information on the drive for a RAID code overNAND flash devices and garbage collection should be taken into accountif possible when setting both the throughput thresholds and the measuredthroughput. A host writing 40 MB/sec of sequential large block writesmay not need throttling at all where as a system doing 30 MB/sec ofrandom unaligned 8K blocks may need throttling since that is theequivalent of 60 MB/sec or more depending on many things to the flashdevices.

The mechanism initializes a time register to keep track of the net timeabove or below a pair of thresholds, which are set so the mechanism canset or remove throttling. Each time the solid-state drive (SSD) ispowered up, the mechanism starts a period counter. It may even benecessary to save such information across power down events if theseoccur regularly. Responsive to the period counter indicating that apredetermined period of time has expired, the mechanism determineswhether the average throughput of the SSD for the predetermined periodof time is greater than a high throughput threshold or lower than a lowthroughput threshold. If the average throughput is greater than the highthroughput threshold, the mechanism increments the time register, and ifthe average throughput is less than the low throughput threshold, themechanism decrements the time register. If the time register exceeds ahigh throttling threshold, the mechanism sets throttling for the SSD. Ifthe time register falls to or below a low throttling threshold, themechanism removes throttling.

This represents the simplest approach to throttling where the result issimply above or below. In accordance with an example embodiment, themechanism may add precision by adding tiers to this approach bydetermining if the average was p above or q below, where p and qrepresent the next tier values up or down from the throughput threshold.For example, if the throughput threshold is 50 MB/sec, then greater than50 and less than 60 would increment by 1, where as greater than 60 butless than 70 would increment by 2, and so forth.

The illustrative embodiments may be utilized in many different types ofdata processing environments including a distributed data processingenvironment, a single data processing device, or the like. In order toprovide a context for the description of the specific elements andfunctionality of the illustrative embodiments, FIGS. 1 and 2 areprovided hereafter as example environments in which aspects of theillustrative embodiments may be implemented. It should be appreciatedthat FIGS. 1 and 2 are only examples and are not intended to assert orimply any limitation with regard to the environments in which aspects orembodiments of the present invention may be implemented. Manymodifications to the depicted environments may be made without departingfrom the spirit and scope of the present invention,

FIG. 1 depicts a pictorial representation of an example distributed dataprocessing system in which aspects of the illustrative embodiments maybe implemented. Distributed data processing system 100 may include anetwork of computers in which aspects of the illustrative embodimentsmay be implemented. The distributed data processing system 100 containsat least one network 102, which is the medium used to providecommunication links between various devices and computers connectedtogether within distributed data processing system 100. The network 102may include connections, such as wire, wireless communication links, orfiber optic cables.

In the depicted example, server 104 and server 106 are connected tonetwork 102 along with storage unit 108. In addition, clients 110, 112,and 114 are also connected to network 102. These clients 110, 112, and114 may be, for example, personal computers, network computers, or thelike. In the depicted example, server 104 provides data, such as bootfiles, operating system images, and applications to the clients 110,112, and 114. Clients 110, 112, and 114 are clients to server 104 in thedepicted example. Distributed data processing system 100 may includeadditional servers, clients, and other devices not shown.

In the depicted example, distributed data processing system 100 is theInternet with network 102 representing a worldwide collection ofnetworks and gateways that use the Transmission ControlProtocol/Internet Protocol (TCP/IP) suite of protocols to communicatewith one another. At the heart of the Internet is a backbone ofhigh-speed data communication lines between major nodes or hostcomputers, consisting of thousands of commercial, governmental,educational and other computer systems that route data and messages. Ofcourse, the distributed data processing system 100 may also beimplemented to include a number of different types of networks, such asfor example, an intranet, a local area network (LAN), a wide areanetwork (WAN), or the like. As stated above, FIG. 1 is intended as anexample, not as an architectural limitation for different embodiments ofthe present invention, and therefore, the particular elements shown inFIG. 1 should not be considered limiting with regard to the environmentsin which the illustrative embodiments of the present invention may beimplemented.

FIG. 2 is a block diagram of an example data processing system in whichaspects of the illustrative embodiments may be implemented. Dataprocessing system 200 is an example of a computer, such as client 110 inFIG. 1, in which computer usable code or instructions implementing theprocesses for illustrative embodiments of the present invention may belocated.

In the depicted example, data processing system 200 employs a hubarchitecture including north bridge and memory controller hub (NB/MCH)202 and south bridge and input/output (I/O) controller hub (SB/ICH) 204.Processing unit 206, main memory 208, and graphics processor 210 areconnected to NB/MCH 202. Graphics processor 210 may be connected toNB/MCH 202 through an accelerated graphics port (AGP).

In the depicted example, local area network (LAN) adapter 212 connectsto SB/ICH 204. Audio adapter 216, keyboard and mouse adapter 220, modem222, read only memory (ROM) 224, hard disk drive (HDD) 226, CD-ROM drive230, universal serial bus (USB) ports and other communication ports 232,and PCI/PCIe devices 234 connect to SR/ICH 204 through bus 238 and bus240. PCI/PCIe devices may include, for example, Ethernet adapters,add-in cards, and PC cards for notebook computers. PCI uses a card buscontroller, while PCIe does not. ROM 224 may be, for example, a flashbasic input/output system (BIOS).

HDD 226 and CD-ROM drive 230 connect to SB/ICH 204 through bus 240. HDD226 and CD-ROM drive 230 may use, for example, an integrated driveelectronics (IDE) or serial advanced technology attachment (SATA)interface, Super I/O (SIO) device 236 may be connected to SB/ICH 204.

An operating system runs on processing unit 206. The operating systemcoordinates and provides control of various components within the dataprocessing system 200 in FIG. 2. As a client, the operating system maybe a commercially available operating system such as Microsoft Windows 7(Microsoft and Windows are trademarks of Microsoft Corporation in theUnited States, other countries, or both). An object-oriented programmingsystem, such as the Java programming system, may run in conjunction withthe operating system and provides calls to the operating system fromJava programs or applications executing on data processing system 200(Java is a trademark of Oracle and/or its affiliates.).

As a server, data processing system 200 may be, for example, an IBM®eServer™ System p® computer system, running the Advanced InteractiveExecutive (AIX®) operating system or the LINUX operating system (IBM,eServer, System p, and AIX are trademarks of International BusinessMachines Corporation in the United States, other countries, or both, andLINUX is a registered trademark of Linus Torvalds in United States,other countries, or both). Data processing system 200 may be a symmetricmultiprocessor (SMP) system including a plurality of processors inprocessing unit 206. Alternatively, a single processor system may beemployed.

Instructions for the operating system, the object-oriented programmingsystem, and applications or programs are located on storage devices,such as HDD 226, and may be loaded into main memory 208 for execution byprocessing unit 206. The processes for illustrative embodiments of thepresent invention may be performed by processing unit 206 using computerusable program code, which may be located in a memory such as, forexample, main memory 208, ROM 224, or in one or more peripheral devices226 and 230, for example.

A bus system, such as bus 238 or bus 240 as shown in FIG. 2, may becomprised of one or more buses. Of course, the bus system may beimplemented using any type of communication fabric or architecture thatprovides for a transfer of data between different components or devicesattached to the fabric or architecture. A communication unit, such asmodem 222 or network adapter 212 of FIG. 2, may include one or moredevices used to transmit and receive data. A memory may be, for example,main memory 208, ROM 224, or a cache such as found in NB/MCH 202 in FIG.2.

Those of ordinary skill in the art will appreciate that the hardware inFIGS. 1 and 2 may vary depending on the implementation. Other internalhardware or peripheral devices, such as flash memory, equivalentnon-volatile memory, or optical disk drives and the like, may be used inaddition to or in place of the hardware depicted in FIGS. 1 and 2. Also,the processes of the illustrative embodiments may be applied to amultiprocessor data processing system, other than the SMP systemmentioned previously, without departing from the spirit and scope of thepresent invention.

Moreover, the data processing system 200 may take the form of any of anumber of different data processing systems including client computingdevices, server computing devices, a tablet computer, laptop computer,telephone or other communication device, a personal digital assistant(PDA), or the like. In some illustrative examples, data processingsystem 200 may be a portable computing device which is configured withflash memory to provide non-volatile memory for storing operating systemfiles and/or user-generated data, for example. Essentially, dataprocessing system 200 may be any known or later developed dataprocessing system without architectural limitation.

FIG. 3 is a block diagram illustrating a solid-state drive in whichaspects of the illustrative embodiments may be implemented. Solid-statedrive 300 may be used in addition to or in place of hard disk drives.For example, solid-state drive 300 may be embodied within storage 108 inFIG. 1 or in place of disk 226 in FIG. 2. Solid-state drive 300comprises a controller 310 and solid-state memory 320. Controller 310has a cache 312, which may be volatile memory, such as dynamic randomaccess memory (DRAM). Solid-state memory 320 may comprise one or morebanks of non-volatile NAND flash memory, for example. Solid-state memory320 may be single-level cell (SLC) or multi-level (MLC) flash memory.

Controller 310 caches read and write data in cache 312 and persistswrites to solid-state memory 320. Controller 310 may apply wear-levelingby throttling performance. More particularly, in accordance with anillustrative embodiment, controller 310 assures an average writethroughput within a range but allows excursions of high throughput withperiods of low throughput offsetting against those of heavy usage.Controller 310 periodically determines average throughput and determineswhether average throughput exceeds a high throughput threshold for acertain amount of time without being offset by periods of lowthroughput. Controller 310 includes data written to solid state memory320 in the average throughput determinations, including metadata, butdoes not include data written to cache 312.

Solid-state drive 300 includes policy 330, which stores user policiesfor policy based throttling, such as dynamic throttling or userconfigurable throttling. Controller 310 may read policy 330 and may setor dynamically adjust thresholds based on policy 330 as wilt bedescribed in further detail below.

As will be appreciated by one skilled in the art, the present inventionmay be embodied as a system, method, or computer program product.Accordingly, aspects of the present invention may take the form of anentirely hardware embodiment, an entirely software embodiment (includingfirmware, resident software, micro-code, etc.) or an embodimentcombining software and hardware aspects that may all generally bereferred to herein as a “circuit,” “module” or “system.” Furthermore,aspects of the present invention may take the form of a computer programproduct embodied in any one or more computer readable medium(s) havingcomputer usable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CDROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

A computer readable signal medium may include a propagated data signalwith computer readable program code embodied therein, for example, in abaseband or as part of a carrier wave. Such a propagated signal may takeany of a variety of forms, including, but not limited to,electro-magnetic, optical, or any suitable combination thereof. Acomputer readable signal medium may be any computer readable medium thatis not a computer readable storage medium and that can communicate,propagate, or transport a program for use by or in connection with aninstruction execution system, apparatus, or device.

Computer code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,optical fiber cable, radio frequency (RF), etc., or any suitablecombination thereof.

Computer program code for carrying out operations for aspects of thepresent invention may be written in any combination of one or moreprogramming languages, including an object oriented programming languagesuch as Java™, Smalltalk™, C++, or the like, and conventional proceduralprogramming languages, such as the “C” programming language or similarprogramming languages. The program code may execute entirely on theuser's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer, or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention are described below with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems) and computer program products according to the illustrativeembodiments of the invention. It will be understood that each block ofthe flowchart illustrations and/or block diagrams, and combinations ofblocks in the flowchart illustrations and/or block diagrams, can beimplemented by computer program instructions. These computer programinstructions may be provided to a processor of a general purposecomputer, special purpose computer, or other programmable dataprocessing apparatus to produce a machine, such that the instructions,which execute via the processor of the computer or other programmabledata processing apparatus, create means for implementing thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmariner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions thatimplement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer,other programmable data processing apparatus, or other devices to causea series of operational steps to be performed on the computer, otherprogrammable apparatus, or other devices to produce a computerimplemented process such that the instructions which execute on thecomputer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

FIG. 4 is a flowchart illustrating operation of a mechanism for enablingthrottling on average write throughput instead of peak write throughputfor solid-state storage devices in accordance with an illustrativeembodiment. The flowchart uses the following terms:

LH: high throughput threshold. This threshold may be in MB/sec, e.g.,110 MB/sec. The high throughput threshold may be some range above theworst case average threshold to be maintained, e.g., 10% above or 1sigma, if a distribution of write rates is available. There may also belevels of LH like LH1, LH2, LH3, each of which increments by 1, 2 or 3,for example, depending on the tier of the threshold.

LL: low throughput threshold. This threshold may be in MB/sec, e.g., 90MB/sec. The low throughput threshold may be some range below the worstcase average threshold to be maintained, e.g., 10% below or 1 sigma, ifa distribution of write rates is available. There may also be levels ofLL like LL1, LL2, LL3, each of which decrements by 1, 2 or 3, forexample, depending on the tier of the threshold.

Each drive will have a particular life it is trying to achieve (like 5years), and then depending on many design criteria like type of flashused, the write amplification, how much over provisioning, etc., one maydetermine the average write throughput to sustain this requiredlifetime. As an example, LH may be set 10% above this throughput and LLmay be set 10% below. The throughput may be measured at the flash, notas delivered by the host. Only write throughput is important. Readthroughput does not affect any of the thresholds or algorithmsdescribed.

L: desired maximum average throughput.

T: time register. This variable keeps track of the net time above orbelow the thresholds (LH, LL) set so that the mechanism can set orremove throttling.

TH: high throttle threshold. This is the high threshold for settingthrottling. If T exceeds TH, the mechanism sets throttling,

TL: low throttle threshold. This is the low threshold for removingthrottling. If T falls to or below TL, the mechanism removes throttling.TL may be equal to TH, zero, or the initial value of T, or may involvesome hysteresis to ensure that the average is closely followed.

Throttling can be done by allowing only so many operations in any giventime and only processing new ones as old ones complete. The throttlingshould be a light throttle so as to minimize system performance order toassure an overall L average throughput the system may have to apply thethrottle for longer periods of time which is desirable. In this way,natural reductions in throughput will not result in throttling becausethe throughput is staying under T naturally. Such throttles as applyingdelay to all input ops would affect performance even if it naturallydropped.

P: periodic interval. This is the period of time for checking theaverage throughput.

Turning to FIG. 4, operation begins, and the mechanism initializes T andstarts a timer (block 402). In one embodiment, the mechanism mayinitialize T to zero; however, alternatively, the mechanism may set T toanother value depending on the implementation. The value of the registerT may become negative or positive. The mechanism may keep the registerin non-volatile memory. The timer may increment by one every unit oftime, such as every second.

The mechanism examines the timer and determines whether a period Pexpires (block 404). The mechanism may set the value of P to a valuerepresenting some unit of time. For example, if the timer incrementsevery second, then the value P may be set to a predetermined number ofseconds. As long as P is small—say 5 minutes—and power cycles rare, itis acceptable if some time periods are not included in the statistics.If the mechanism determines that P time does not expire, operationreturns to block 404 until P time expires. If the mechanism determinesthat P time expires in block 404, the mechanism determines the averagewrite throughput for the period P by taking the MB written and dividingby the number of seconds in P (block 406).

By determining average write throughput in this manner, the mechanismallows short bursts of high write throughput. As long as these burstsare relatively short and are offset by low write throughput within theperiod P, the average write throughput will not cause the mechanism toset throttling for the solid-state storage device. Since manyapplications have some variability in their throughput, such a designwill have minimum impact on the system.

The mechanism determines whether the average write throughput is greaterthan a high throughput threshold LEI (block 408). If the average writethroughput is not greater than LH, the mechanism determines whether theaverage write throughput is less than a low throughput threshold (block410). If the average write throughput is not greater than LH and notless than LL, no change occurs and the solid-state storage deviceoperates in a default manner. Thereafter, operation returns to block 404to determine if another time period P expires.

If the average write throughput is greater than LH in block 408, themechanism increments T (block 412). The mechanism then determineswhether T is greater than a high throttle threshold TH (block 414). Ifthe mechanism determines that is greater than TH, the mechanism appliesthrottling to the write throughput of the solid-state storage device(block 416); otherwise, the solid-state storage continues to operate ina default manner. The mechanism may set throttling at L such that thesolid-state storage device will simply not be able to go above thatthroughput. Thereafter, operation returns to block 404 to determine ifanother time period P expires.

If the average write throughput is less than in block 410, the mechanismdecrements T (block 418). The mechanism then determines whether T isless than or equal to a low throttle threshold TL (block 420). If themechanism determines that is less than or equal to TL, the mechanismremoves throttling from the write throughput of the solid-state storagedevice (block 422); otherwise, the solid-state storage continues tooperate in its current state, which may be with or without throttlingapplied. Thereafter, operation returns to block 404 to determine ifanother time period P expires.

In one example embodiment, the mechanism may increment T in block 412and decrement T in block 418 by such that the value T represents theamount of time the write throughput is considered high. One may set thevalues of LH and LL such that represents the amount of time the averagewrite throughput is above L, for example. In another example embodiment,the mechanism may increment T in block 412 and decrement T block 418 by1 (one) such that T represents a number of periods the write throughputis considered high.

One may set the values of LH, LL, T, TH, and/or TL to control theaverage write throughput depending on the implementation. For example,one may set the values such that the overall average write throughputclosely follows the desired maximum average throughput for optimalperformance. Alternatively, one may set the values such that the overallaverage write throughput stays relatively low to extend the lifecycle ofthe solid-state storage device. In one example embodiment, the mechanismmay dynamically adjust the values of LH, LL, T, TH, and/or TL to achievethe least amount of throttling while still keeping the overall averagewrite throughput below a desired maximum average another exampleembodiment, one may set the values based on service level agreements toachieve specific overall average write throughput on acustomer-by-customer basis or for different times of day, for example.

In one example embodiment, one may set P to a high value, e.g., 12hours, and then monitor the throughput. If the average write throughputfor each 12-hour period, for example, is above LH, then the mechanismapplies the throttle. In this example, the mechanism may monitor thethroughput every 12 hours until the average is below L and then removethe throttle. After another 12 hours, the mechanism may monitorthroughput again and set the throttle if the average throughput againexceeds LH. For this example, LH may be set at 10% above L because themechanism must apply the throttle for much greater periods of time. Thisexample is more forgiving with burstiness, but more severe withthrottling.

In another example embodiment, the mechanism may employ hysteresis todynamically adjust thresholds based on actual throughput. For instance,if the mechanism determines the average throughput is below the lowthreshold for a period of time, the mechanism may allow higher or longerbursts of throughput and maintain the same life of the solid-statedevice. Thus, responsive to determining the average throughput is belowthe low threshold, LL, for a predetermined number of periods, themechanism may increase the high throughput threshold, LH, or highthrottle threshold, TH.

If the mechanism determines the solid-state drive experiences a highamount of throttling due to average throughput being greater than thehigh throughput threshold for period of time, the mechanism may prompt auser to select whether to decrease device lifetime to reduce throttling.Responsive to the user selecting to sacrifice device lifetime forperformance, the mechanism may increase the thresholds.

In another example embodiment, a user may define throttling settings ina policy. For example, a user may indicate a desired life of thesolid-state drive, and the mechanism may calculate the thresholds basedon the device lifetime set in the policy. As another example, a user maydefine a throttling level to conserve energy. The mechanism may thencalculate the thresholds based on the user-defined throttling level. Asa further example, a user may define a performance level, and themechanism may calculate the thresholds based on the user-definedperformance level.

The flowchart and block diagrams in the figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

Thus, the illustrative embodiments provide a mechanism for enablingthrottling on average write throughput instead of peak write throughputfor solid-state storage devices. The mechanism assures an average writethroughput within a range but allows excursions of high throughput withperiods of low throughput offsetting against those of heavy usage. Themechanism periodically determines average throughput and determinewhether average throughput exceeds a high throughput threshold for acertain amount of time without being offset by periods of lowthroughput.

As noted above, it should be appreciated that the illustrativeembodiments may take the form of an entirety hardware embodiment, anentirely software embodiment or an embodiment containing both hardwareand software elements. In one example embodiment, the mechanisms of theillustrative embodiments are implemented in software or program code,which includes but is not limited to firmware, resident software,microcode, etc.

A data processing system suitable for storing and/or executing programcode will include at least one processor coupled directly or indirectlyto memory elements through a system bus. The memory elements can includelocal memory employed during actual execution of the program code, hulkstorage, and cache memories which provide temporary storage of at leastsome program code in order to reduce the number of times code must beretrieved from bulk storage during execution.

Input/output or I/O devices (including but not limited to keyboards,displays, pointing devices, etc.) can be coupled to the system eitherdirectly or through intervening I/O controllers. Network adapters mayalso be coupled to the system to enable the data processing system tobecome coupled to other data processing systems or remote printers orstorage devices through intervening private or public networks. Modems,cable modems and Ethernet cards are just a few of the currentlyavailable types of network adapters.

The description of the present invention has been presented for purposesof illustration and description, and is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the art. Theembodiment was chosen and described in order to best explain theprinciples of the invention, the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

1-20. (canceled)
 21. A method, in a data processing system, forthrottling a solid-state storage device on average write throughput, themethod comprising: for each given period of time, determining averagewrite throughput to a solid-state storage device over the given periodof time; determining a first amount of time that average writethroughput is high; determining a second amount of time that averagewrite throughput is low; and throttling write throughput to thesolid-state storage device based on a comparison of the first amount oftime and the second amount of time.
 22. The method of claim 21, whereindetermining the first amount of time that average write throughput ishigh comprises incrementing a time register for each period of timeaverage write throughput to the solid-state storage device over thegiven period of time is greater than a high throughput threshold; andwherein determining the first amount of time that average writethroughput is low comprises decrementing the time register for eachperiod of time average write throughput to the solid-state storagedevice over the given period of time is less than a low throughputthreshold.
 23. The method of claim 22, wherein throttling writethroughput to the solid-state storage device based on the comparison ofthe first amount of time and the second amount of time comprises:responsive to the time register exceeding a high throttle threshold,setting throttling on write throughput to the solid-state storagedevice.
 24. The method of claim 23, wherein throttling write throughputto the solid-state storage device based on the comparison of the firstamount of time and the second amount of time comprises: responsive tothe time register falling below a low throttle threshold, removingthrottling on write throughput to the solid-state storage device. 25.The method of claim 21, wherein deter mining the first amount of timethat average write throughput is high and determining the second amountof time that average write throughput is low comprises tracking thefirst amount of time relative to the second amount of time using asingle time register.
 26. The method of claim 22, wherein incrementingthe time register comprises incrementing the time register by the givenperiod of time.
 27. The method of claim 22, wherein decrementing thetime register comprises decrementing the time register by the givenperiod of time.
 28. The method of clam 22, further comprising;responsive to determining the average write throughput is low for apredetermined amount of time, dynamically adjusting the high throughputthreshold or the high throttle threshold.
 29. The method of claim 22,farther comprising: determining the low throughput threshold, the highthroughput threshold, the low throttle threshold, and the high throttlethreshold based on a user configurable policy.
 30. The method of claim29, wherein the user configurable policy defines one of a user-defineddevice lifetime, a user-defined performance level, or a user-definedthrottle level.
 31. The method of claim 21, wherein determining averagewrite throughput to a solid-state storage device over the given periodof time comprises determining a rate at which data is written to flashdevices within the solid-state storage device.
 32. The method of claim21, wherein determining average write throughput to a solid-statestorage device over the given period of time comprises dividing anamount of data and metadata written to solid-state memory of thesolid-state storage device by the given period of time.